normal algorithmの例文

例文携帯版

Normal algorithms have proved to be a convenient means for the construction of many sections of constructive mathematics.
Any entity that is experiencing pain clearly has its normal algorithm being interfered with by the running of an emergency algorithm.
Any normal algorithm is equivalent to some Turing machine, and vice versa any Turing machine is equivalent to some normal algorithm.
Any normal algorithm is equivalent to some Turing machine, and vice versa any Turing machine is equivalent to some normal algorithm.
A version of the Church-Turing thesis formulated in relation to the normal algorithm is called the " principle of normalization ."
Moreover, inherent in the definition of a normal algorithm used in a number of ideas aimed at handling symbolic information programming languages-for example, in Refal.
The process of applying the normal algorithm to an arbitrary word V in the alphabet of this algorithm is a discrete sequence of elementary steps, consisting of the following.
Definition of any normal algorithm consists of two parts : the definition of the " alphabet " algorithm ( the algorithm will be applied to words of these alphabet symbols ), and the definition of its " scheme ".